---
categories: Graph algorithms, Combinatorial optimization
---

## Problems
- [Minimum Cost Maximum Flow](https://open.kattis.com/problems/mincostmaxflow)
- [Admiral](http://2012.nwerc.eu/media/NWERC_2012_ProblemSet_FINAL.pdf) [^1]
- [Job Postings](https://open.kattis.com/problems/jobpostings)
- [Catering](https://open.kattis.com/problems/catering) [^2]

## External links
- [TopCoder tutorial](https://www.topcoder.com/community/data-science/data-science-tutorials/) on minimum cost flow:
    - [Part 1 - Key Concepts](https://www.topcoder.com/community/data-science/data-science-tutorials/minimum-cost-flow-part-one-key-concepts/)
    - [Part 2 - Algorithms](https://www.topcoder.com/community/data-science/data-science-tutorials/minimum-cost-flow-part-two-algorithms/)
    - [Part 3 - Applications](https://www.topcoder.com/community/data-science/data-science-tutorials/minimum-cost-flow-part-three-applications/)
- [Minimum Cost Flow](https://codeforces.com/blog/entry/50842), presentation by Sergiu Marin (includes more problems).

## See also
- [Maximum flow]()

[^1]: <http://2012.nwerc.eu/media/ProblemSet-presentation.pdf>
[^2]: <http://www.csc.kth.se/~austrin/icpc/finals2015solutions.pdf>